A Shape-from-shading Framework for Satisfying Data-closeness and Structure-preserving Smoothness Constraints
نویسندگان
چکیده
A key problem in shape-from-shading is how to simultaneously satisfy data-closeness and regularisation (such as surface smoothness) constraints. This paper makes two contributions towards solving this problem. The first is to describe a smoothness constraint which preserves surface structure by adaptively smoothing according to the intensity gradient magnitude. The second is to derive a framework which seeks to strictly satisfy this constraint while maintaining zero brightness error. Experimental results on both synthetic and real world imagery demonstrate that our method is both robust and accurate and outperforms a number of existing techniques. We propose an alternative regularisation constraint which employs information about the intensity gradient in all directions over a local neighbourhood. For a pixel (x,y), we define the local neighborhood as Ω(x,y)= {(x + 1,y),(x−1,y),(x,y + 1),(x,y−1)}. We precompute the change in incident angle between all pairs of neighboring pixels:
منابع مشابه
New Constraints on Data-Closeness and Needle Map Consistency for Shape-from-Shading
ÐThis paper makes two contributions to the problem of needle-map recovery using shape-from-shading. First, we provide a geometric update procedure which allows the image irradiance equation to be satisfied as a hard constraint. This not only improves the data closeness of the recovered needle-map, but also removes the necessity for extensive parameter tuning. Second, we exploit the improved eas...
متن کاملDirect Variational Perspective Shape from Shading with Cartesian Depth Parametrisation
Most of today’s state-of-the-art methods for perspective shape from shading are modelled in terms of partial differential equations (PDEs) of HamiltonJacobi type. To improve the robustness of such methods w.r.t. noise and missing data, first approaches have recently been proposed that seek to embed the underlying PDE into a variational framework with data and smoothness term. So far, however, s...
متن کاملNumerical Shape from Shading and Occluding Contours in a Single View
An iterative method of using occluding boundary information is proposed to compute surface slope from shading. We use a stereographic space rather than the more commonly used gradient space in order to express occluding boundary information. Further, we use "average" smoothness constraints rather than the more obvious "closed loop" smoothness constraints. We develop alternate constraints from t...
متن کامل3D Surface Topography from Intensity Images
This paper demonstrates how a new shape from shading scheme can be used to extract topographic information from 2D intensity imagery. The shape-from-shading scheme has two novel ingredients. Firstly, it uses a geometric update procedure which allows the image irradiance equation to be satisfied as a hard-constraint. This not only improves the data-closeness of the recovered needle-map, but also...
متن کاملPii: S0262-8856(98)00173-5
This article describes how robust error-kernels can be used as smoothness priors in recovering shape-from-shading (SFS). Conventionally, the smoothness error is added to the data-closeness (or brightness-error) as a quadratic regularizer. This leads to over-smoothing of the recovered needle-map or surface, and the loss of important detail provided by surface discontinuities. To solve this probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009